Clark's Theorem on linear programs holds for convex programs
نویسندگان
چکیده
منابع مشابه
Conditioning of convex piecewise linear stochastic programs
In this paper we consider stochastic programming problems where the objective function is given as an expected value of a convex piecewise linear random function. With an optimal solution of such a problem we associate a condition number which characterizes well or ill conditioning of the problem. Using theory of Large Deviations we show that the sample size needed to calculate the optimal solu...
متن کاملA Frank-Wolfe Type Theorem for Convex Polynomial Programs
In 1956, Frank and Wolfe extended the fundamental existence theorem of linear programming by proving that an arbitrary quadratic function f attains its minimum over a nonempty convex polyhedral set X provided f is bounded from below over X . We show that a similar statement holds if f is a convex polynomial and X is the solution set of a system of convex polynomial inequalities. In fact, this r...
متن کاملOn convex quadratic programs with linear complementarity constraints
The paper shows that the global resolution of a general convex quadratic program with complementarity constraints (QPCC), possibly infeasible or unbounded, can be accomplished in finite time. The method constructs a minmax mixed integer formulation by introducing finitely many binary variables, one for each complementarity constraint. Based on the primal-dual relationship of a pair of convex qu...
متن کاملOn Conically Ordered Convex Programs
In this paper we study a special class of convex optimization problems called conically ordered convex programs (COCP), where the feasible region is given as the level set of a vector-valued nonlinear mapping, expressed as a nonnegative combination of convex functions. The nonnegativity of the vectors is defined using a pre-described conic ordering. The new model extends the ordinary convex pro...
متن کاملADMM for Convex Quadratic Programs: Linear Convergence and Infeasibility Detection
In this paper, we analyze the convergence of Alternating Direction Method of Multipliers (ADMM) on convex quadratic programs (QPs) with linear equality and bound constraints. The ADMM formulation alternates between an equality constrained QP and a projection on the bounds. Under the assumptions of: (i) positive definiteness of the Hessian of the objective projected on the null space of equality...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1978
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.75.4.1624